/*
提交链接:https://leetcode.cn/problems/climbing-stairs/
70. 爬楼梯
赖德檀 2024/12/28
*/

class Solution {
public:
    int climbStairs(int n) {
        vector<int>dp(100,0);
        dp[1]=1;
        dp[2]=2;
        for(int i=3;i<=n;i++)
        {
            dp[i]=dp[i-1]+dp[i-2];
        }
        return dp[n];
    }
};